Lossless Image Compression by Block Matching on Practical Massively Parallel Architectures
نویسندگان
چکیده
Work-optimal O(log M log n) time implementations of lossless image compression by block matching are shown on the PRAM EREW, where n is the size of the image and M is the maximum size of the match, which can be implemented on practical architectures such as meshes of trees, pyramids and multigrids. The workoptimal implementations on pyramids and multigrids are possible under some realistic assumptions. Decompression on these architectures is also possible with the same parallel computational complexity.
منابع مشابه
Compressing Bi-Level Images by Block Matching on a Tree Architecture
A work-optimal O(log M log n) time parallel implementation of lossless image compression by block matching of bi-level images is shown on a full binary tree architecture under some realistic assumptions, where n is the size of the image and M is the maximum size of the match. Decompression on this architecture is also possible with the same parallel computational complexity. Such implementation...
متن کاملLossless Image Compression by Block Matching
Lossless image compression has often employed techniques quite separate from those used for text compression or lossy image compression; most standards today employ modelling followed by coding (e.g. the JBIG standard, the IBM Q-coder, CCITT Group 4). Constantinescu and Storer present a lossy image compression scheme that can be viewed as a generalization of lossless dynamic dictionary compress...
متن کاملSpeeding up Lossless Image Compression: Experimental Results on a Parallel Machine
Arithmetic encoders enable the best compressors both for bi-level images (JBIG) and for grey scale and color images (CALIC), but they are often ruled out because too complex. The compression gap between simpler techniques and state of the art compressors can be significant. Storer extended dictionary text compression to bi-level images to avoid arithmetic encoders (BLOCK MATCHING), achieving 70...
متن کاملA Work-Optimal Parallel Implementation of Lossless Image Compression by Block Matching
Abstra t. Storer suggested that fast en oders are possible for two-dimensional lossless ompression by showing a square greedy mat hing LZ1 heuristi for bilevel images, whi h an be implemented by a simple hashing s heme [S96℄. In this paper, we show a work-optimal parallel algorithm using a re tangle greedy mat hing te hnique requiring O(logM logn) time on the PRAM EREW model, where n is the siz...
متن کاملParallel Implementation of the Full Search Block Matching Algorithm for Motion Estimation - Application Specific Array Processors, 1995. Proceedings., International Conference on
Motion estimation is a key technique in most algorithms for video compression and particularly in the MPEG and H.261 standards. The most frequently used technique is based on a Full Search Block Matching Algorithm which is highly computing intensive and requires the use of special purpose architectures to obtain real-time performance. In this paper we propose an approach to the parallel impleme...
متن کامل